Model Checking Languages of Data Words
نویسندگان
چکیده
We consider the model-checking problem for data multipushdown automata (DMPA). DMPA generate data words, i.e, strings enriched with values from an infinite domain. The latter can be used to represent an unbounded number of process identifiers so that DMPA are suitable to model concurrent programs with dynamic process creation. To specify properties of data words, we use monadic second-order (MSO) logic, which comes with a predicate to test two word positions for data equality. While satisfiability for MSO logic is undecidable (even for weaker fragments such as first-order logic), our main result states that one can decide if all words generated by a DMPA satisfy a given formula from the full MSO logic.
منابع مشابه
Colored Nested Words
Nested words allow modeling of linear and hierarchical structure in data, and nested word automata are special kinds of pushdown automata whose push/pop actions are directed by the hierarchical structure in the input nested word. The resulting class of regular languages of nested words has many appealing theoretical properties, and has found many applications, including model checking of proced...
متن کاملModel Checking: From Tools to Theory
Model checking is often cited as a success story for transitioning and engineering ideas rooted in logics and automata to practice. In this paper, we discuss how the efforts aimed at improving the scope and effectiveness of model checking tools have revived the study of logics and automata leading to unexpected theoretical advances whose impact is not limited to model checking. In particular, w...
متن کاملLogics and Automata for Software Model - Checking 1
While model-checking of pushdown models is by now an established technique in software verification, temporal logics and automata traditionally used in this area are unattractive on two counts. First, logics and automata traditionally used in model-checking cannot express requirements such as pre/post-conditions that are basic to software analysis. Second, unlike in the finite-state world, wher...
متن کاملBounded Model Checking for All Regular Properties
The technique of bounded model checking is extended to the linear time μ-calculus, a temporal logic that can express all monadic second-order properties of ω-words, in other words, all ω-regular languages. Experimental evidence is presented showing that the method can be successfully employed for properties that are hard or impossible to express in the weaker logic LTL that is traditionally use...
متن کاملKhmer Spell Checker
Khmer is the official language of Cambodia. It is a complex language. Similar to Chinese, Japanese and Thai, Khmer words are written without spaces or other word delimiters. This is a major challenge in spell checking Khmer since there is no simple way to determine word boundaries. However, it is feasible to spell check Khmer. The process of spell checking Khmer is different from the spell chec...
متن کامل